Obtaining Traceability Codes from Chinese Reminder Theorem Codes

نویسندگان

  • Marcel Fernandez
  • Miguel Soriano
  • Josep Cotrina Navau
چکیده

SUMMARY Traceability codes are used in schemes that prevent illegal redistribution of digital content. In this Letter, we use Chinese Reminder Theorem codes to construct traceability codes. Both the code parameters and the traitor identification process take into account the non-uniformity of the alphabet of Chinese Reminder Theorem codes. Moreover it is shown that the identification process can be done in polynomial time using list decoding techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Good traceability codes do exist

Traceability codes are combinatorial objects introduced by Chor, Fiat and Naor in 1994 to be used to trace the origin of digital content in traitor tracing schemes. Let F be an alphabet set of size q and n be a positive integer. A t-traceability code is a code C ⊆ Fn which can be used to catch at least one colluder from a collusion of at most t traitors. It has been shown that t-traceability co...

متن کامل

Traceability and Quality Control in Traditional Chinese Medicine: From Chemical Fingerprint to Two-Dimensional Barcode

Chemical fingerprinting is currently a widely used tool that enables rapid and accurate quality evaluation of Traditional Chinese Medicine (TCM). However, chemical fingerprints are not amenable to information storage, recognition, and retrieval, which limit their use in Chinese medicine traceability. In this study, samples of three kinds of Chinese medicines were randomly selected and chemical ...

متن کامل

On a Class of Traceability Codes

Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon-Stinson-Wei’s problem of the existence of traceability codes with q < w and b > q. We provide a large class of these codes constructed by using a new general construction method for q-ary codes.

متن کامل

A note on an upper bound of traceability codes

Blackburn, Etzion and Ng showed in a paper in 2010 that there exist 2-traceability codes of length l of size cqdl/4e, where the constant c depends only on l. The question remains as to what the best possible c may be. A well-known construction using error-correcting codes with high minimum distance gives 2-traceability codes of size cqdl/4e with c ≥ 1. However, in the same paper, an example of ...

متن کامل

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

In this paper we investigate combinatorial properties and constructions of two recent topics of cryptographic interest namely frameproof codes for digital ngerprinting and traceability schemes for broadcast encryption We rst give combinatorial descriptions of these two objects in terms of set systems and also discuss the Hamming distance of frameproof codes when viewed as error correcting codes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 89-A  شماره 

صفحات  -

تاریخ انتشار 2006